Laboratory 1 Discrete Cosine Transform and Karhunen-Loeve Transform

نویسنده

  • Miaohui Wang
چکیده

Block based transform coding is used to convert spatial pixel values to transform coefficients in the frequency domain. Since a linear transforms is employed in image and video compression, the energy in spatial domain is equal to the energy in the transform domain but the coefficients is compacted into the low frequency area. The convenience is that most of the energy is compacted in a few large transform coefficients. After the quantization, most of the coefficients will be zero and it can save a lot of bits to represent the original image. The reason of incorporated block transform for image compression can be simply concluded by two points: − Energy compaction: a few of basis functions are sufficient to represent a given image. − Decorrelation: coefficients in transform domain are decorrelated. Linear transform coding can be consider as using a set basis functions to represent a given image. In other words, a image X can be expand as a linear combination of some basis function si.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Comparison of Image Approximation Methods: Fourier Transform, Cosine Transform, Wavelets Packet and Karhunen-Loeve Transform

In this paper we compare the performance of several transform coding methods, Discrete Fourier Transform, Discrete Cosine Transform, Wavelets Packet and Karhunen-Loeve Transform, commonly used in image compression systems through experiments. These methods are compared for the effectiveness as measured by rate-distortion ratio and the complexity of computation.

متن کامل

Compression of image clusters using Karhunen Loeve transformations

This paper proposes to extend the Karhunen-Loeve compression algorithm to multiple images. The resulting algorithm is compared against single-image Karhunen Loeve as well as algorithms based on the Discrete Cosine Transformation (DCT). Futhermore, various methods for obtaining compressable clusters from large image databases are evaluated.

متن کامل

Optimal approximation of uniformly rotated images: relationship between Karhunen-Loeve expansion and discrete cosine transform

We present the concept that for uniformly rotated images, the optimal approximation of the images can be obtained by computing the basis vectors for the discrete cosine transform (DCT) of the original image in polar coordinates, and that the images can be represented as linear combinations of the basis vectors.

متن کامل

A brief survey of a DCT-Based Speech Enhancement System

Discrete Cosine Transform (DCT) has similar performance to the Karhunen-Loeve Transform (KLT) & same properties to the Discrete Fourier Transform (DFT). It is advantageous for speech enhancement as it provides better energy compaction capability. Though there is a perfectly stationary signal, frame to frame variations of DCT coefficients are observed. In pitch synchronous analysis DCT based spe...

متن کامل

Fast Cosine Transform to increase speed-up and efficiency of Karhunen-Loeve Transform for lossy image compression

In this work, we present a comparison between two techniques of image compression. In the first case, the image is divided in blocks which are collected according to zig-zag scan. In the second one, we apply the Fast Cosine Transform to the image, and then the transformed image is divided in blocks which are collected according to zig-zag scan too. Later, in both cases, the Karhunen-Loève trans...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012